Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
نویسندگان
چکیده
In this paper, we construct two classes of t × n, s-disjunct matrix with subspaces in orthogonal space F(2ν+1) q of characteristic 2 and exhibit their disjunct properties. We also prove that the test efficiency t/n of constructions II is smaller than that of D’yachkov et al. (J. Comput. Biol. 12:1129–1136, 2005).
منابع مشابه
Constructing error-correcting pooling designs with symplectic space
We construct a family of error-correcting pooling designs with the incidence matrix of two types of subspaces of symplectic spaces over finite fields. We show that the new construction gives better ratio of efficiency compared with previously known three constructions associated with subsets of a set, its analogue over a vector space, and the dual spaces of a symplectic space.
متن کاملThe arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
In this paper, we construct a d-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s−1), s−1)-subspaces and the tighter bounds for an error-tolerant pooling design. Moreover, we give the tighter analysis of our construction by the results of the arrangement problem. Additionally, by comparing our construction with...
متن کاملNew constructions of non-adaptive and error-tolerance pooling designs
We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be -error-detecting and thus -error-correcting, where , a positive integer, is the maximum number of defectives (or positives). Hence, the number of errors which can be detected grows linearly with the number of positives. Also, this construction induces a construction of a binary code with minimum Hammin...
متن کاملA class of error-correcting pooling designs over complexes
As a generalization of d-disjunct matrices and (w, r;d)-cover-freefamilies, the notion of (s, l)-disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w, r, d)cover-free-families form a class of (s, l)-disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s, l)-disjunct matrices is considered.
متن کاملConstructions of Optical Orthogonal Codes from Finite Geometry
The link between finite geometry and various classes of error-correcting codes is well known. Arcs in projective spaces, for instance, have a close tie to linear MDS codes as well as the high-performing low-density parity-check codes. In this article, we demonstrate a connection between arcs and optical orthogonal codes (OOCs), a class of non-linear binary codes used for many modern communicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 20 شماره
صفحات -
تاریخ انتشار 2010